What you should know about location modeling

Facility location models have been applied to problems in the public and private sectors for years. In this article, the author first presents a taxonomy of location problems based on the underlying space in which the problem is embedded. The article illustrates problems from each part of the taxonomy with an emphasis on discrete location problems. Selected recent research in the area is also discussed. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

雷达部署对进动目标微多普勒频率的可测性分析

以导弹攻防对抗中防御雷达对空间目标的微多普勒频率检测为背景,分析了雷达部署位置对进动目标微多普勒测量值的影响.理论上可证明,当目标的外形尺寸和进动参数确定后,微多普勒频率由进动轴和雷达视线的夹角(平均视线角)唯一决定.从雷达部署在弹道平面内不同区域以及雷达距弹道平面不同距离两方面出发,分析了微多普勒调制带宽随雷达位置的...     

自适应两步滤波算法在机载IRSTS被动定位中的应用

在机载红外搜索跟踪系统被动定位研究中,针对扩展卡尔曼滤波算法要求先验的噪声统计及存在系统观测模型线性化误差影响滤波精度的特点,利用两步滤波算法并结合Sage-Husa噪声估计器构建了适用于机载IRSTS被动定位特点的自适应两步滤波算法模型,算法不仅实时在线地估计了观测噪声的统计特性,而且避免了观测模型线性化误差.仿真结果表明,在完全相同的初始条件下,自适应两步滤波算法对目标运动参数的估计结果明显优于扩展卡尔曼滤波,从而提高了机载IRSTS被动定位的精度.     

关于"指挥与控制工程"学科的初步探讨

阐述了指挥与控制及其系统的概念、意义、作用,初步探讨了指挥与控制工程的研究对象、研究内容、研究目的及学科体系,希望引起专业领域内专家学者对指挥与控制工程学科的关注,以共同促进指挥与控制工程科学技术的发展.     

基于DOA/多普勒信息的单站无源定位

基于运动辐射源的到达方向(DOA)和多普勒信息,在建立目标运动模型和测量方程的基础上,分别研究了基于DOA/多普勒频率以及DOA/多普勒频差的定位算法.计算机仿真结果表明,给出的定位算法是正确的,基于DOA/多普勒信息对运动目标的单站无源定位技术是可行的.     

舰载无源被动定位与卡尔曼滤波

根据舰载无源被动定位的特点,论述了用舰载雷达侦察设备通过测向对敌舰载雷达进行定位时,采用卡尔曼滤波提高被动定位精度及跟踪精度的原理和方法,为导弹进行隐蔽攻击奠定了基础。     

引入测频信息进行无源被动定位的方法研究

无源被动定位技术中一个重要问题，是如何使定位的约束条件尽可能地少，即尽可能地提高方法的可操作性。只利用测角信息（ＤＯＡ）的定位方法，由于可观测性的要求，在单观测平台对运动目标定位时，常常需要观测平台作特殊的机动运动，这种约束给实际操作带来很大不便。本文提出了一种引入测频信息对运动目标进行定位的定位方法，并给出了可观测性分析。运用该定位法定位，观测平台的运动形式可以任意，特别有意义的是，在满足某些条件情况下观测平台还可以完全静止不动。     

基于扩展卡尔曼滤波的浮标定位方法

由于浮标的随机漂移,在航空搜潜过程中,需要定期对浮标的位置进行更新。根据航空搜潜声纳浮标与飞机的相对方位信息,采用扩展卡尔曼滤波技术,分析了计算浮标位置的原理、方法,建立了相应的系统模型和仿真算法,从估计的相对位置误差和均方根误差两个方面,仿真分析了系统的误差性能。结果表明,该定位模型能够成功地跟踪浮标的位置,并具有较高的定位精度。     

Analysis and optimal design of discrete order picking technologies along a line

Order picking accounts for most of the operating expense of a typical distribution center, and thus is often considered the most critical function of a supply chain. In discrete order picking a single worker walks to pick all the items necessary to fulfill a single customer order. Discrete order picking is common not only because of its simplicity and reliability, but also because of its ability to pick orders quickly upon receipt, and thus is commonly used by e‐commerce operations. There are two primary ways to reduce the cost (walking distance required) of the order picking system. First is through the use of technology—conveyor systems and/or the ability to transmit order information to pickers via mobile units. Second is through the design—where best to locate depots (where workers receive pick lists and deposit completed orders) and how best to lay out the product. We build a stochastic model to compare three configurations of different technology requirements: single‐depot, dual‐depot, and no‐depot. For each configuration we explore the optimal design. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Capacitated warehouse location model with risk pooling

In this article, we introduce the capacitated warehouse location model with risk pooling (CLMRP), which captures the interdependence between capacity issues and the inventory management at the warehouses. The CLMRP models a logistics system in which a single plant ships one type of product to a set of retailers, each with an uncertain demand. Warehouses serve as the direct intermediary between the plant and the retailers for the shipment of the product and also retain safety stock to provide appropriate service levels to the retailers. The CLMRP minimizes the sum of the fixed facility location, transportation, and inventory carrying costs. The model simultaneously determines warehouse locations, shipment sizes from the plant to the warehouses, the working inventory, and safety stock levels at the warehouses and the assignment of retailers to the warehouses. The costs at each warehouse exhibit initially economies of scale and then an exponential increase due to the capacity limitations. We show that this problem can be formulated as a nonlinear integer program in which the objective function is neither concave nor convex. A Lagrangian relaxation solution algorithm is proposed. The Lagrangian subproblem is also a nonlinear integer program. An efficient algorithm is developed for the linear relaxation of this subproblem. The Lagrangian relaxation algorithm provides near‐optimal solutions with reasonable computational requirements for large problem instances. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008